Ray-Triangle Intersection Algorithm for Modern CPU Architectures
نویسندگان
چکیده
We present an algorithm for determining if a ray intersects a triangle interior; and computing intersection point parameters as well as distance of intersection in response to the ray intersecting a triangle interior. Particularly a variation of a hybrid test having all benefits of Plücker and projected barycentric tests is proposed. The test is also vectorized using SIMD instructions for efficient handling ray packets. It is essential for achieving high ray tracing performance on modern CPUs. Our implementation also detects axis-orthogonal triangles and processing them separately. For maximum performance we also introduce a method for triangle representation, using only necessary pre-computed values. We also present inherently thread-safe and memory efficient alternative of mailboxing to avoid unnecessary intersection tests for ray packet in case when many leaves share the same triangle.
منابع مشابه
Hardware-Accelerated Ray-Triangle Intersection Testing for High-Performance Collision Detection
We present a novel approach for hardware-accelerated collision detection. This paper describes the design of the hardware architecture for primitive inference testing components implemented on a multi-FPGA Xilinx Virtex-II prototyping system. This paper focuses on the acceleration of ray-triangle intersection operation which is the one of the most important operations in various applications su...
متن کاملFast Ray-Triangle Intersection Computation Using Reconfigurable Hardware
We present a novel FPGA-accelerated architecture for fast collision detection among rigid bodies. This paper describes the design of the hardware architecture for several primitive intersection testing components implemented on a multi-FPGA Xilinx Virtex-II prototyping system. We focus on the acceleration of ray-triangle intersection operation which is the one of the most important operations i...
متن کاملFast Ray-Triangle Intersections by Coordinate Transformation
Ray-triangle intersection is a crucial calculation in ray tracing. We present a new algorithm for finding these intersections, occupying a different place in the spectrum of time-space tradeoffs than existing algorithms do. Our algorithm provides faster ray-triangle intersection calculations at the expense of precomputing and storing a small amount of extra information for each triangle. Runnin...
متن کاملInteractive Ray Tracing Using Hardware Accelerated Image-Space Methods
In recent years, interactive ray tracing has become realisable, albeit mainly using clustered workstations and sophisticated acceleration structures. On nonclustered computer architectures this is still not an easy task to achieve, especially when rendering animated scenes, even though the computation power of modern workstations is increasing rapidly. In this paper we propose commonly known im...
متن کاملGPU-based real time FRep ray casting
A new method is presented for rendering general FRep (functionally represented) models using GPU-accelerated ray casting. We use the GPU acceleration for all computations in the rendering algorithm: ray-surface intersection calculation, function evaluation, and normal vector computation. Performing geometric intersection calculations in parallel with shading allows us to combine the whole proce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007